منابع مشابه
A note on Robinson consistency lemma
Since A. Robinson’s work, this result has been shown valid for a large class of logic and recently has received generalizations in institutions [8]. One of the main reason why a logic should have RCP is because of “modular theory building”. Indeed, RCP has been shown to be equivalent to Craig’s interpolation property (CIP), and CIP is strongly connected to modularity in specification theory [2,...
متن کاملA Note on Lipshitz's Lemma 3
In this note, we give a remark on the proof of Lemma 3 by Lipshitz in [1]. This remark is motivated by the observation that the statement from line −8 to −3 on page 375 of [1] seems not completely correct. 1 An algebraic description of Lipshitz’s Lemma Let K be a field of characteristic zero, and K(x, y) be the field of rational functions in x and y over K. Denote by R2 the ring K(x, y)〈Dx,Dy〉 ...
متن کاملA note on kernels and Sperner's Lemma
The kernel-solvability of perfect graphs was first proved by Boros and Gurvich, and later Aharoni andHolzmangave a shorter proof. Bothproofswere based on Scarf’s Lemma. In this note we show that a very simple proof can be given using a polyhedral version of Sperner’s Lemma. In addition, we extend the Boros–Gurvich theorem to h-perfect graphs and to a more general setting. © 2009 Elsevier B.V. A...
متن کاملNote on the 3-graph counting lemma
Szemerédi’s regularity lemma proved to be a powerful tool in extremal graph theory. Many of its applications are based on the so-called counting lemma: if G is a kpartite graph with k-partition V1∪ · · ·∪Vk, |V1| = · · · = |Vk| = n, where all induced bipartite graphs G[Vi, Vj ] are (d, ε)-regular, then the number of k-cliques Kk in G is d( k 2)nk(1± o(1)). Frankl and Rödl extended Szemerédi’s r...
متن کاملA Note on the Trinomial Analogue of Bailey's Lemma
Recently, Andrews and Berkovich introduced a trinomial version of Bailey’s lemma. In this note we show that each ordinary Bailey pair gives rise to a trinomial Bailey pair. This largely widens the applicability of the trinomial Bailey lemma and proves some of the identities proposed by Andrews and Berkovich. The trinomial Bailey lemma In a recent paper, Andrews and Berkovich (AB) proposed a tri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1944
ISSN: 0003-4851
DOI: 10.1214/aoms/1177731242